Learning Anchor Planes for Classification
نویسندگان
چکیده
Local Coordinate Coding (LCC) [18] is a method for modeling functions of data lying on non-linear manifolds. It provides a set of anchor points which form a local coordinate system, such that each data point on the manifold can be approximated by a linear combination of its anchor points, and the linear weights become the local coordinate coding. In this paper we propose encoding data using orthogonal anchor planes, rather than anchor points. Our method needs only a few orthogonal anchor planes for coding, and it can linearize any (α, β, p)-Lipschitz smooth nonlinear function with a fixed expected value of the upper-bound approximation error on any high dimensional data. In practice, the orthogonal coordinate system can be easily learned by minimizing this upper bound using singular value decomposition (SVD). We apply our method to model the coordinates locally in linear SVMs for classification tasks, and our experiment on MNIST shows that using only 50 anchor planes our method achieves 1.72% error rate, while LCC achieves 1.90% error rate using 4096 anchor points.
منابع مشابه
An algorithm for the anchor points of the PPS of the CCR model
Anchor DMUs are a new class in the general classification of Decision Making Units (DMUs) in Data Envelopment Analysis (DEA). An anchor DMU in DEA is an extreme-efficient DMU that defines the transition from the efficient frontier to the free-disposability part of the boundary of the Production Possibility Set (PPS). In this paper, the anchor points of the PPS of the CCR model are investigated....
متن کاملA Survey of Currency Anchor Selection in East-West Asia
As the number of independent countries increases and their economies become more integrated, we would expect to observe more multi-country currency :::union:::s. This paper explores the pros and cons for different countries to adopt as an anchor the US Dollar, the Euro or the Yen. In addition, it addresses the question of how co-movement of outputs and prices would respond to the formation of ...
متن کاملOptimizing Locally Linear Classifiers with Supervised Anchor Point Learning
Kernel SVM suffers from high computational complexity when dealing with large-scale nonlinear datasets. To address this issue, locally linear classifiers have been proposed for approximating nonlinear decision boundaries with locally linear functions using a local coding scheme. The effectiveness of such coding scheme depends heavily on the quality of anchor points chosen to produce the local c...
متن کاملData-Aware Picking for Medical Models
Medical doctors are often faced with the problem of selecting anchoring points in 3D space. These points are commonly used for measurement tasks, such as lengths of bones, or dimensions of pathological structures (e. g. tumours). Since previous research indicates that measurement tasks can be usually carried out more efficiently in VR environments than in desktop-based systems, we have concentr...
متن کاملHaines and Calway: Detecting Planes from a Single Image
We propose an algorithm to detect planes in a single image of an outdoor urban scene, capable of identifying multiple distinct planes, and estimating their orientation. Using machine learning techniques, we learn the relationship between appearance and structure from a large set of labelled examples. Plane detection is achieved by classifying multiple overlapping image regions, in order to obta...
متن کامل